Graphs for n-circular matroids
نویسنده
چکیده
We give ”if and only if” characterization of graphs with the following property: given n ≥ 3, edges of such graphs form matroids with circuits from the collection of all graphs with n fundamental cycles. In this way we refer to the notion of matroidal family defined by Simões-Pereira [2].
منابع مشابه
Structural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملOn matroids on edge sets of graphs with connected subgraphs as circuits II
It is proved that if $• is a finite family of connected, finite graphs, then a graph G exists such that the subgraphs of G isomorphic to a member of the family cannot be regarded as the circuits of a matroid on the edge set of G. 1. In a recent paper [1] we have proved that there are only two matroids on the edge set of any graph G (let us call them edge set matroids), whose circuits are connec...
متن کاملOn Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits
It is proved that if $• is a finite family of connected, finite graphs, then a graph G exists such that the subgraphs of G isomorphic to a member of the family cannot be regarded as the circuits of a matroid on the edge set of G. 1. In a recent paper [1] we have proved that there are only two matroids on the edge set of any graph G (let us call them edge set matroids), whose circuits are connec...
متن کاملComplexity of Testing Reachability in Matroids
We extend the complexity theoretic framework of reachability problems in graphs to the case of matroids. Given a matroid M and two elements s and t of the ground set, the reachability problem is to test if there is a circuit in M containing both s and t. We show complexity characterizations for several important classes of matroids. In particular, we show: (1) For two important classes of matro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 2010